Analysis of Queues with an Imperfectly Repairable Server
نویسندگان
چکیده
We consider a queueing system where the server is subject to failures and can be repaired within a random period of time. After an "imperfect" repair, the server (machine) will be in a state between "as good as new" and "as bad as old". The server state will determine either the failure rate or the service rate or both. A Quasi Birth Death process is developed for modeling such a system. We investigate the effect of maintenance policy on the queue and on overall performance. Under a cost structure, we illustrate the search for the optimal maintenance policy to minimize the costs. Queueing effects on the average cost of operating such a system are examined with numerical analysis. Many examples of such structures exist in practice. KeywordsImperfect repair, quasi birth death process, stationary distribution, threshold policy, average operating cost.
منابع مشابه
Reliability Analysis of the Retrial Queue with Server Breakdowns and Repairs
Retrial queues have been widely used to model many problems arising in telephone switching systems, telecommunication networks, computer networks and computer systems, etc. It is of basic importance to study reliability of retrial queues with server breakdowns and repairs because of limited ability of repairs and heavy influence of the breakdowns on the performance measure of the system. Howeve...
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملBernoulli Vacation Policy for a Bulk Retrial Queue with Fuzzy Parameters
In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...
متن کامل